Patterns in words of ordered set partitions
نویسندگان
چکیده
منابع مشابه
Set partitions as geometric words
Using an analytic method, we derive an alternative formula for the probability that a geometrically distributed word of length n possesses the restricted growth property. Equating our result with a previously known formula yields an algebraic identity involving alternating sums of binomial coefficients via a probabilistic argument. In addition, we consider refinements of our formula obtained by...
متن کاملPattern Avoidance in Ordered Set Partitions
In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for certain special cases, and a recursive technique to exactly enumerate the appropriate set partitions in general. We also give some asymptotic results for the growth rates of the number of ordered set partitions avoiding a single pattern; includ...
متن کاملPartitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملLimit Behavior of Maxima in Geometric Words representing Set Partitions
We consider geometric words ω1 · · ·ωn with letters satisfying the restricted growth property ωk ≤ d + max{ω0, . . . , ωk−1}, where ω0 := 0 and d ≥ 1. For d = 1 these words are in 1-to-1 correspondence with set partitions and for this case we show that the number of left-to-right maxima (suitable centered) does not converge to a fixed limit law as n tends to infinity. This becomes wrong for d ≥...
متن کاملFibonacci numbers, ordered partitions, and transformations of a finite set
A method of representing transformations of a finite set pictorially is described. These pictures of a function are used to count certain idempotent transformations, and interesting formulae for the Fibonacci numbers are obtained. No part of any string extends beyond the region ° : : ; z ::; 1, and if two strings intersect then they join together, from the point of intersection, to meet the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2019
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2019.v10.n3.a2